Teaching Modern Heuristics in Combinatorial Optimization
نویسنده
چکیده
The article describes the proposition and implementation of a demonstration, learning and decision support system for the resolution of combinatorial optimization problems under multiple objectives. The system brings together two key aspects of higher education: research and teaching. It allows the user to define modern metaheuristics and test their resolution behavior on machine scheduling problems. The software may be used by students and researcher with even little knowledge in the mentioned field of research, as the interaction of the user with the system is supported by an extensive graphical user interface. All functions can be easily parameterized, and expensive software licenses are not required. In order to address a large number of users, the system is localizable with little effort. So far, the user interface is available in seven languages. The software has been honored in Ronneby (Sweden) with the European Academic Software Award 2002, a prize for learning and research software awarded biannually by EKMA, the European Knowledge Media Association (http://www.easa-award.net/, http://www.bth.se/llab/easa_2002.nsf).
منابع مشابه
Teaching Modern Heuristics in Combinatorial Optimization The example of a demonstration and research tool employing metaheuristics in scheduling
The article describes the proposition and implementation of a demonstration, learning and decision support system for the resolution of combinatorial optimization problems under multiple objectives. The system brings together two key aspects of higher education: research and teaching. It allows the user to define modern metaheuristics and test their resolution behavior on machine scheduling pro...
متن کاملAn optimization technique for vendor selection with quantity discounts using Genetic Algorithm
Vendor selection decisions are complicated by the fact that various conflicting multi-objective factors must be considered in the decision making process. The problem of vendor selection becomes still more compli-cated with the inclusion of incremental discount pricing schedule. Such hard combinatorial problems when solved using meta heuristics produce near optimal solutions. This paper propose...
متن کاملAn integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method
In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...
متن کاملParallel Tabu Search for Optimizing the OSPF Weight Setting Problem
The problem of setting the Open Shortest Path First (OSPF) weights on links such that congestion can be avoided is proved to be NP-hard. Many iterative heuristics have been applied to solve the OSPF weight setting (OSPFWS) problem. As the size of any combinatorial optimization problem increases, it becomes more difficult to find an optimum solution using sequential algorithms. Parallelization o...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کامل